On multipartite tournament matrices with constant team size∗
نویسندگان
چکیده
منابع مشابه
Tournament MAC with Constant Size Congestion Window for WLAN
In the context of radio distributed networks, we present a generalized approach for the Medium Access Control (MAC) with fixed congestion window. Our protocol is quite simple to analyze and can be used in a lot of different situations. We give mathematical evidence showing that our performance is tight, in the sense that no protocol with fixed congestion window can do better. We also place ours...
متن کاملTournament Matrices with Extremal Spectral Properties
For a tournament matrix M of order n, we de ne its walk space, WM , to be SpanfM 1 : j = 0; . . . ; n 1g where 1 is the all ones vector. We show that the dimension of WM equals the number of eigenvalues of M whose real parts are greater than 1=2. We then focus on tournament matrices whose walk space has particularly simple structure, and characterize them in terms of their spectra. Speci cally,...
متن کاملThe number of kings in a multipartite tournament
We show that in any n-partite tournament, where n/> 3, with no transmitters and no 3-kings, the number of 4-kings is at least eight. All n-partite tournaments, where n/>3, having eight 4-kings and no 3-kings are completely characterized. This solves the problem proposed in Koh and Tan (accepted).
متن کاملTeam size effect on teamwork productivity using information technology
Teams are defined as high performing task groups whose members are actively interdependent and share common performance objectives. This definition suggests that only those groups who perform at high levels due to their collective efforts must be considered as teams. In this paper, a model has been presented for de-termining the effects of information technology in the output of teamwork with Y...
متن کاملOn the ranking of a Swiss system chess team tournament
The paper suggests a family of paired comparison-based scoring procedures using linear algebra for ranking the participants of a Swiss system chess team tournament. We present the main challenges of ranking in Swiss system, the features of individual and team competitions as well as the failures of official lexicographical orders. The tournament is represented as a ranking problem, our model is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear and Multilinear Algebra
سال: 1993
ISSN: 0308-1087,1563-5139
DOI: 10.1080/03081089308818241